A Quadratic Constraint Total Least-squares Algorithm for Hyperbolic Location
نویسندگان
چکیده
A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint total least-squares (QC-TLS) method and gives an explicit solution. The total least-squares method is a generalized data fitting method that is appropriate for cases when the system model contains error or is not known exactly, and quadratic constraint, which could be realized via Lagrange multipliers technique, could constrain the solution to the location equations to improve location accuracy. Comparisons of performance with ordinary least-squares are made, and Monte Carlo simulations are performed. Simulation results indicate that the proposed algorithm has high location accuracy and achieves accuracy close to the CramerRao lower bound (CRLB) near the small TDOA measurement error region.
منابع مشابه
The Regularized Total Least Squares Problem: Theoretical Properties and Three Globally Convergent Algorithms
Total Least Squares (TLS) is a method for treating an overdetermined system of linear equations Ax ≈ b, where both the matrix A and the vector b are contaminated by noise. In practical situations, the linear system is often ill-conditioned. For example, this happens when the system is obtained via discretization of ill-posed problems such as integral equations of the first kind (see e.g., [7] a...
متن کاملThe Equality Constrained Indefinite Least Squares Problem : Theory and Algorithms ∗ †
We present theory and algorithms for the equality constrained indefinite least squares problem, which requires minimization of an indefinite quadratic form subject to a linear equality constraint. A generalized hyperbolic QR factorization is introduced and used in the derivation of perturbation bounds and to construct a numerical method. An alternative method is obtained by employing a generali...
متن کاملRegularized Total Least Squares Based on Quadratic Eigenvalue Problem Solvers
This paper presents a new computational approach for solving the Regularized Total Least Squares problem. The problem is formulated by adding a quadratic constraint to the Total Least Square minimization problem. Starting from the fact that a quadratically constrained Least Squares problem can be solved via a quadratic eigenvalue problem, an iterative procedure for solving the regularized Total...
متن کاملA New Technique for Image Zooming Based on the Moving Least Squares
In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...
متن کاملFinding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
We consider the problem of minimizing a fractional quadratic problem involving the ratio of two indefinite quadratic functions, subject to a two sided quadratic form constraint. This formulation is motivated by the so-called Regularized Total Least Squares problem (RTLS). A key difficulty with this problem is its nonconvexity, and all current known methods to solve it are only guaranteed to con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJCNS
دوره 1 شماره
صفحات -
تاریخ انتشار 2008